Generalizing Graphs Using Amalgamation and Selection

نویسندگان

  • John G. Stell
  • Michael F. Worboys
چکیده

This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying data is structured as a graph. The paper presents a new approach in that a distinction is made between generalizations that amalgamate data objects and those that select data objects. We show that these two types of generalization are conceptually distinct, and provide a formal framework in which both can be understood. Generalizations that are combinations of amalgamation and selection are termed simpliications, and the paper provides a formal framework in which simpliications can be computed (for example, as compositions of other simpliications). A detailed case study is presented to illustrate the techniques developed, and directions for further work are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing Amalgamation of Graphs on Set of Shorter Path Algorithm Using Genetic Algorithm

The aim of this paper is to verify the algorithm, “Search the Set of Shorter Paths” [23] which clip the graph into levels (Levelled Graph) and find the set of shorter paths from source to destination. When the algorithm operates on heuristically amalgamated graphs of three types is executing properly. The graph or network consists of the amalgamation of different types graph as Roadways, Railwa...

متن کامل

Snakes and Caterpillars in Graceful Graphs

Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...

متن کامل

Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs

Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.

متن کامل

Amalgamations and Link Graphs of Cayley Graphs

The link of a vertex v in a graph G is the subgraph induced by all vertices adjacent to v. If all the links in G are isomorphic to the same graph L, then L is called the link graph of G. We consider the operation of an amalgamation of graphs. Using the construction of the free product of groups with amalgamated subgroups, we give a sufficient condition for a class of link graphs of Cayley graph...

متن کامل

Genus Distributions for Iterated Claws

We derive a recursion for the genus distributions of the graphs obtained by iteratively attaching a claw to the dipole D3. The minimum genus of the graphs in this sequence grows arbitrarily large. The families of graphs whose genus distributions have been calculated previously are either planar or almost planar, or they can be obtained by iterative single-vertex or single-edge amalgamation of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999